CHARACTERISTICS OF SHACKLE GRAPH: Shack(Kn,v(j,i),t), Shack(Sn,v(j,i),t), & Shack(K(n,n),v(rj,i),t)
نویسندگان
چکیده
<p class="AfiliasiCxSpFirst" align="left"><strong>Abstrak:</strong></p><p class="AfiliasiCxSpMiddle">Operasi schackle adalah operasi antara dua atau lebih graf yang menghasilkan baru. Graf shackle dinotasikan dihasilkan dari t salinan diberi simbol dengan dimana dan bilangan asli. Operasi ppada penelitian ini titik. titik artinya dibangun sembarang sebanyak sebagai . Kelas akan di eksporasi karakterisinya kromatinya <em>, S</em> &amp; Hasil penelitiannya menunjukkan bahwa kromatik sama subgraf pembangunnya.</p><p class="AfiliasiCxSpMiddle" align="left"> </p><p class="AfiliasiCxSpLast" align="left"><strong>Kata Kunci</strong>:</p><p>Operasi Shackle, Shackle titik, shackle, kromatik.</p><p> align="left"><strong><em>Abstract:</em></strong></p><p class="AfiliasiCxSpMiddle"><em>A operation is an between two or more graphs that results in a new graph. graph notated </em> <em> </em><em>is product from copy of denoted by where and are natural numbers. The this research vertex shackle. Vertex which means the constructed any as many copies linkage vertex. class examined study <em>.</em> <em>The show ch</em><em>r</em><em>omatic number same subgraph generates it</em><em>.</em></p><p align="left"><strong><em>Keywords</em></strong><em>:</em></p><p><em>Shackle Operation, Graph</em><em>, Chromatic Numbers.</em></p>
منابع مشابه
dynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولCharacteristics of Common Neighborhood Graph under Graph Operations and on Cayley Graphs
Let G(V;E) be a graph. The common neighborhood graph (congraph) of G is a graph with vertex set V , in which two vertices are adjacent if and only if they have a common neighbor in G. In this paper, we obtain characteristics of congraphs under graph operations; Graph :::::union:::::, Graph cartesian product, Graph tensor product, and Graph join, and relations between Cayley graphs and its c...
متن کاملBounds of Graph Characteristics
This report presents a basic scheme for deriving systematically a filtering algorithm from the graph properties based representation of global constraints. This scheme is based on the bounds of the graph characteristics used in the description of a global constraint. The report provides bounds for the most common used graph characteristics.
متن کاملGraph Characteristics from the Quantum Jensen-Shannon Graph Kernel
In this paper, we use the quantum Jensen-Shannon divergence as a means to establish the similarity between a pair of graphs and to develop a novel graph kernel. In quantum theory, the quantum Jensen-Shannon divergence is defined as a distance measure between quantum states. In order to compute the quantum Jensen-Shannon divergence between a pair of graphs, we first need to associate a density o...
متن کاملSurvey of Graph Energies
Let graph energy is a graph--spectrum--based quantity, introduced in the 1970s. After a latent period of 20--30 years, it became a popular topic of research both in mathematical chemistry and in ``pure'' spectral graph theory, resulting in over 600 published papers. Eventually, scores of different graph energies have been conceived. In this article we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Axiom
سال: 2021
ISSN: ['2580-0450', '2087-8249']
DOI: https://doi.org/10.30821/axiom.v10i2.9252